Checking experiments for stream X-machines

نویسنده

  • Robert M. Hierons
چکیده

Stream X-machines are a state based formalism that has associated with it a particular development process in which a system is built from trusted components. Testing thus essentially checks that these components have been combined in a correct manner and that the orders in which they can occur are consistent with the specification. Importantly, there are test generation methods that return a checking experiment: a test that is guaranteed to determine correctness as long as the implementation under test (IUT) is functionally equivalent to an unknown element of a given fault domain Ψ. Previous work has show how three methods for generating checking experiments from a finite state machine (FSM) can be adapted to testing from a stream X-machine. However, there are many other methods for generating checking experiments from an FSM and these have a variety of benefits that correspond to different testing scenarios. This paper shows how any method for generating a checking experiment from an FSM can be adapted to generate a checking experiment for testing an implementation against a stream X-machine. This is the case whether we are testing to check that the IUT is functionally equivalent to a specification or we are testing to check that every trace (input/output sequence) of the IUT is also a trace of a nondeterministic specification. Interestingly, this holds even if the fault domain Ψ used is not that traditionally associated with testing from a stream Xmachine. The results also apply for both deterministic and nondeterministic implementations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Communicating Stream X-Machines Systems are no more than X-Machines

A version of the communicating stream X-machine model is proposed, which gives a precise representation of the operation of transferring data from one X-machine to another. For this model it is shown that systems of communicating Xmachines have the same computational power as single stream X-machines. This enable existing methods for deriving test strategies for stream X-machines to be extended...

متن کامل

Mike Holcombe

The generalized stream X-machines (stream X-machines with basic functions replaced by relations and having as output, strings of symbols rather than single symbols) with output delimiter (any output string has at the right end side a special delimiter) are introduced. It is proved that testing methods similar to those already developed for ordinary determi-nistic stream X-machines may be applie...

متن کامل

Deterministic stream X-machines based on grammar systems

This paper investigates the power of the stream X machines ba sed on cooperating distributed grammar systems which replaces relations by functions The case of regular rules is considered The deterministic case is introduced in order to allow the application of some already deve loped testing strategies Some conditions for getting equivalent stream X machines in the derivation mode are studied

متن کامل

Deterministic Stream X - machinesBased on Grammar

This paper investigates the power of the stream X-machines based on cooperating distributed grammar systems which replaces relations by functions. The case of regular rules is considered. The deterministic case is introduced in order to allow the application of some already developed testing strategies. Some conditions for getting equivalent stream X-machines in the = 1 derivation mode are stud...

متن کامل

Testing conformance of a deterministic implementation against a non-deterministic stream X-machine

Stream X-machines are a formalisation of extended finite state machines that have been used to specify systems. One of the great benefits of using stream X-machines, for the purpose of specification, is the associated test generation technique which produces a test that is guaranteed to determine correctness under certain design for test conditions. This test generation algorithm has recently b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 411  شماره 

صفحات  -

تاریخ انتشار 2010